Critical Path Analysis for the Execution of Parallel and Distributed Programs

نویسندگان

  • Cui-Qing Yang
  • Barton P. Miller
چکیده

This paper presents the design, implementation and testing of the critical path analysis technique on the IPS performance measurement tool for parallel and distributed programs. We create a precedence graph of a program’s activities (Program Activity Graph) with the data collected during the execution of a program. The critical path, the longest path in the program activity graph, represents the sequence of the program activities that take the longest time to execute. Various algorithms are developed to track the critical path from this graph. The events in this path are associated with the entities in the source program and the statistical results are displayed based on the hierarchical structure of the IPS. The test results from the measurement of sample programs show that the knowledge of the critical path in a program’s execution helps users identify performance problems and better understand the behavior of a program.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Optimization using Critical Path Analysis in Multithreaded Programs on Multiprocessors

Efficient performance tuning of parallel programs is often hard. Optimization is often done when the program is written as a last effort to increase the performance. With sequential programs each (executed) code segment will affect the total execution time of the program. Thus, any code segment that is optimized in a sequential program will decrease the execution time. In the case of a parallel...

متن کامل

Performance Optimization Using Extended Critical Path Analysis in Multithreaded Programs on Multiprocessors

Efficient performance tuning of parallel programs is often hard. Optimization is often done when the program is written as a last effort to increase the performance. With sequential programs each (executed) code segment will affect the completion time. In the case of a parallel program executed on a multiprocessor this is not always true, due to dependencies between the different threads. Thus,...

متن کامل

الگوریتم جدیدی برای تحلیل حساسیت مسیر بحرانی در شبکه های پرت با درنظر گرفتن ریسک های موجود در پروژه

Taking into account, the uncertain time duration for each activity in a pert network, we would need to accept the notion that the critical path of the project could also vary a number of times during its execution. If these variations take place frequently during the project in an unpredictable manner, it could endanger the efficient management of that project, and in addition to lengthening th...

متن کامل

Critical Path Profiling of Message Passing and Shared-Memory Programs

In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our algorithm permits starting or stopping the critical path computation during program execution and reporting intermediate values. We also present an online algorithm to compute a variant of critical path, called critical...

متن کامل

Near–Critical Path Analysis: A Tool for Parallel Program Optimization

Program activity graphs (PAGs) can be constructed from timestamped traces of appropriate execution events. Information about the activities on the k longest execution paths is useful in the analysis of parallel program performance. In this paper, four algorithms for finding the near–critical paths of PAGs are compared, including a best–first search (BFS) algorithm that is worst–case asymptotica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988